翻訳と辞書 Words near each other ・ Beam homogenizer ・ Beam Invader ・ Beam lead technology ・ Beam me up ・ Beam Me Up Scotty (mixtape) ・ Beam Me Up! (Daniel Johnston album) ・ Beam me up, Scotty ・ Beam of Light ・ Beam parameter product ・ Beam park ・ Beam projector ・ Beam propagation method ・ Beam Reach ・ Beam riding ・ BEAM robotics ・ Beam search ・ Beam splitter ・ Beam spoiler ・ Beam stack search ・ Beam steering ・ Beam Suntory ・ Beam tetrode ・ Beam tilt ・ Beam tracing ・ Beam Valley Country Park ・ Beam waveguide antenna ・ Beam's Eight Star ・ Beam's eye view ・ Beam's Shell Service Station and Office ・ Beam, Great Torrington Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Beam search ： ウィキペディア英語版 Beam search In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beam search is an optimization of best-first search that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to some heuristic which attempts to predict how close a partial solution is to a complete solution (goal state). But in beam search, only a predetermined number of best partial solutions are kept as candidates.〔(beam search from FOLDOC )〕 Beam search uses breadth-first search to build its search tree. At each level of the tree, it generates all successors of the states at the current level, sorting them in increasing order of heuristic cost.〔(British Museum Search )〕 However, it only stores a predetermined number of best states at each level (called the beam width). Only those states are expanded next. The greater the beam width, the fewer states are pruned. With an infinite beam width, no states are pruned and beam search is identical to breadth-first search. The beam width bounds the memory required to perform the search. Since a goal state could potentially be pruned, beam search sacrifices completeness (the guarantee that an algorithm will terminate with a solution, if one exists). Beam search is not optimal (that is, there is no guarantee that it will find the best solution). It returns the first solution found. The beam width can either be fixed or variable. One approach that uses a variable beam width starts with the width at a minimum. If no solution is found, the beam is widened and the procedure is repeated.〔Norvig, Peter. ''Paradigms of Artificial Intelligence''. http://books.google.com/books?id=X4mhySvjqUAC&pg=PA196&lpg=PA196&dq=beam+search+in+paradigms+of+artificial+intelligence+programming&source=web&ots=20BH2lB3sc&sig=udBIO2Qeg8awaySgwCu7gDEObY4&hl=en&sa=X&oi=book_result&resnum=1&ct=result#PPA196,M1 Programming〕 == Name == The term "beam search" was coined by Raj Reddy, Carnegie Mellon University, 1976. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Beam search」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.